منابع مشابه
On One-relator Inverse Monoids and One-relator Groups
It is known that the word problem for one-relator groups and for one-relator monoids of the form Mon〈A ‖ w = 1〉 is decidable. However, the question of decidability of the word problem for general one-relation monoids of the form M = Mon〈A ‖ u = v〉 where u and v are arbitrary (positive) words in A remains open. The present paper is concerned with one-relator inverse monoids with a presentation o...
متن کاملAutomorphisms of One-relator Groups
It is a well-known fact that every group G has a presentation of the form G = F/R, where F is a free group and R the kernel of the natural epimorphism from F onto G. Driven by the desire to obtain a similar presentation of the group of automorphisms Aut(G), we can consider the subgroup Stab(R) ⊆ Aut(F ) of those automorphisms of F that stabilize R, and try to figure out if the natural homomorph...
متن کاملConjugacy Separability of Some One-Relator Groups
Conjugacy separability of any group of the class of one-relator groups given by the presentation a, b; a m , b n 1m, n > 1 is proven. The proof made used of theoretical combinatorial group methods, namely the structure of amalgamated free products and some properties of the subgroups and quotients of any group of the class of one-relator groups given above.
متن کاملSome results on one-relator surface groups
If S is noncompact, or has nonempty boundary, then π1(S) is free, and the answer to Question 1 is yes, by an old result of Magnus [7] on one-relator groups. (Essentially, the defining relator in a one-relator group on a given generating set is unique up to conjugacy and inversion.) We will show (see Theorem 3.4 below) that Question 1 also has an affirmative answer in the case of a closed surfac...
متن کاملDelzant’s T-invariant and One-relator Groups
We prove that for " most " one-relator groups Delzant's T-invariant (which measures the smallest size of a finite presentation for a group) is comparable in magnitude with the length of the defining relator. The proof relies on our previous results regarding algebraic rigidity of generic one-relator groups and on the methods of algorithmic probability involving Kolmogorov-Chaitin complexity.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 2008
ISSN: 0010-1354,1730-6302
DOI: 10.4064/cm111-1-8